FPCF Input-Queued Packet Switch for Variable-Size Packets

نویسندگان

  • Peter Homan
  • Janez Bester
چکیده

The existing forward planning conflict-free (FPCF) packet switches are designed for fixed-size packets and synchronous operation mode. In this paper an asynchronous FPCF packet switch for variable-size packets is proposed. The key problem of efficient packet insertion procedure was solved by introduction of a so-called quasi-synchronous record array arrangement. A performance evaluation based on simulations is provided in terms of throughput, delay and loss probability. The limited maximum switch throughput is a deficiency of the presented asynchronous FPCF packet switch. In most cases, utilization of over 90% can be achieved by using multiple traffic flows, while preserving proper packet order. Maximum packet delays are comparable to those produced by output-queued packet switches. By comparing FPCF and virtual-output-queued packet switches a conclusion is drawn that FPCF switch produces both, lower maximum packet delays and lower packet delay variations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basic Characteristics of FIFO Packet Switches

In this paper we compare characteristics of different FIFO packet switch types. In accordance with our expectations, the best results are obtained by using the output-queued packet switches. The main drawback of these switches is the need for a fast switching fabric. This can be avoided by using the input-queued packet switches, whose performance depends upon individual packet sizes. Characteri...

متن کامل

On the Provision of Integrated Qos Guarantees of Switches * Unicast and Multicast Traffic in Input - Queued

In this paper, we address the problem of providing QoS guarantees for multiple input-queued switching architecture. Stable matching of inputs and outputs is used for scheduling the enqueued packets to be transmitted across the switching fabric. With an in-depth theoretic analysis on the properties of stable matching in the context of a multiple input-queued switch, we propose efficient schemes ...

متن کامل

Performance evaluation of new scheduling methods for the RR/RR CICQ switch

Increasing link speeds and port counts in packet switches demand that methods for minimizing internal speed-up and implementing fast scheduling be developed. Combined input and cross point queued (CICQ) switches with round-robin (RR) polling of virtual output queues (VOQ) and of cross point buffers can natively forward variable-length packets without a required internal segmentation into cells....

متن کامل

Router Architectures Exploiting Input-Queued Cell-Based Switching Fabrics

Input queued and combined input/output queued switching architectures must be controlled by a scheduling algorithm, which solves contention in the transfer of data units to switch outputs. We consider the case of packet switches (or routers), i.e., devices operating on variable-size data units at their interfaces, assuming that they internally operate on fixed-size data units, and we propose no...

متن کامل

Packet Scheduling in Input-Queued Cell-Based Switches

Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for input-queued cell switches, operating on fixed-size data u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001